Reliable prediction in the Markov stochastic block model

نویسندگان

چکیده

We introduce the Markov Stochastic Block Model (MSBM): a growth model for community based networks where node attributes are assigned through Markovian dynamic. rely on HMMs’ literature to design prediction methods that robust local clustering errors. focus specifically link and collaborative filtering problems we new selection procedure infer number of hidden clusters in network. Our approaches reliable MSBMs not algorithm-dependent sense they can be applied using your favourite tool. In this paper, use recent SDP method communities provide theoretical guarantees. particular, identify relevant signal-to-noise ratio (SNR) our framework prove misclassification error decays exponentially fast with respect SNR.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Reconstructability in the Stochastic Block Model

We consider the problem of clustering (or reconstruction) in the stochastic block model, in the regime where the average degree is constant. For the case of two clusters with equal sizes, recent results [MNS13, Mas14, MNS14] show that reconstructability undergoes a phase transition at the Kesten-Stigum bound of λ 2 d = 1, where λ2 is the second largest eigenvalue of a related stochastic matrix ...

متن کامل

Reconstruction in the Labeled Stochastic Block Model

The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two endpoints belong to the same community or not. It has been conjectured in [1] t...

متن کامل

The Block Diagonal Infinite Hidden Markov Model

The Infinite Hidden Markov Model (IHMM) extends hidden Markov models to have a countably infinite number of hidden states (Beal et al., 2002; Teh et al., 2006). We present a generalization of this framework that introduces nearly block-diagonal structure in the transitions between the hidden states, where blocks correspond to “subbehaviors” exhibited by data sequences. In identifying such struc...

متن کامل

Spectral Partitiong in a Stochastic Block Model

In this lecture, we will perform a crude analysis of the performance of spectral partitioning algorithms in what are called stochastic block models or a planted partition model. The name you choose largely depends on your community and application. As we are especially interested today in partitioning, we will call it the planted partition model. In this model, we build a random graph that has ...

متن کامل

Prediction of Land Use Change and its Hydrological Effects Using Markov Chain Model and SWAT Model

Access to current and future water resources is one of the concerned problems for managers and policymakers around the world. Because of the communication between water resources and land use, these two topics had come together in different researches. Scenarios designed in regional land planning provide the basis for analyzing the existing opportunities and making the right decisions for manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Esaim: Probability and Statistics

سال: 2023

ISSN: ['1292-8100', '1262-3318']

DOI: https://doi.org/10.1051/ps/2022019